The number of oriented rational links with a given deficiency number
نویسندگان
چکیده
Let [Formula: see text] be the set of un-oriented and rational links with crossing number text], a precise formula for was obtained by Ernst Sumners in 1987. In this paper, we study enumeration problem oriented links. let ([Formula: text]) deficiency text]. derive formulas any given show that where is text]th convolution convolved Fibonacci sequences.
منابع مشابه
On the oriented chromatic number of graphs with given excess
The excess of a graph G is defined as the minimum number of edges that must be deleted from G in order to get a forest. We prove that every graph with excess at most k has chromatic number at most 1 2(3+ √ 1 + 8k) and that this bound is tight. Moreover, we prove that the oriented chromatic number of any graph with excess k is at most k+3, except for graphs having excess 1 and containing a direc...
متن کاملThe number of permutations with a given number of sequences
P (n, s) denotes the number of permutations of 1, 2,. .. n that have exactly s sequences. Canfield and Wilf [math.CO/0609704] recently showed that P (n, s) can be written as a sum of s polynomials in n. We determine these polynomials explicitly and also obtain explicit expressions for P (n, s) and its fixed-s generating function us(x).
متن کاملThe minimal number with a given number of divisors
A number n is said to be ordinary if the smallest number with exactly n divisors is p q1−1 1 · · · p qa−1 a where q1 · · · qa is the prime factorization of n and q1 ≥ . . . ≥ qa (and where pk denotes the k-th prime). We show here that all square–free numbers are ordinary and that the set of ordinary numbers has natural density one.
متن کاملThe relationship between the distinguishing number and the distinguishing index with detection number of a graph
This article has no abstract.
متن کاملOn the Number of Minimal Surfaces with a given Boundary
In [TT78], Tomi and Tromba used degree theory to solve a longstanding problem about the existence of minimal surfaces with a prescribed boundary: they proved that every smooth, embedded curve on the boundary of a convex subset of R must bound an embedded minimal disk. Indeed, they proved that a generic such curve must bound an odd number of minimal embedded disks. White [Whi89] generalized thei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Knot Theory and Its Ramifications
سال: 2021
ISSN: ['1793-6527', '0218-2165']
DOI: https://doi.org/10.1142/s0218216521500656